homotopy theory, (∞,1)-category theory, homotopy type theory
flavors: stable, equivariant, rational, p-adic, proper, geometric, cohesive, directed…
models: topological, simplicial, localic, …
see also algebraic topology
Introductions
Definitions
Paths and cylinders
Homotopy groups
Basic facts
Theorems
A semi-simplicial set is like a simplicial set, but without the degeneracy maps: it is a sequence of sets together with functions called face maps between them which encode that an element in has “faces” (boundary segments) which are elements in .
The semi-simplicial set version of a simplicial complex is also called a Delta set.
Let denote the simplex category, which is a skeleton of the category of inhabited finite totally ordered sets. Let denote the wide subcategory of containing only the injective functions (it is sometimes written , , , or ). Thus, is equivalent to the category of inhabited finite totally ordered sets and order-preserving injections.
Recall that a simplicial set is a presheaf . Similarly, a semi-simplicial set is a presheaf .
More generally, for any other category, a functor is a semi-simplicial object in .
The forgetful functor from SimplicialSets to the category of semi-simplicial sets is given by precomposition with the opposite functor of the non-full wide subcategory inclusion
into the simplex category and hence has both a left adjoint as well as a right adjoint given by left/right Kan extension, respectively:
The adjunction unit of the left adjoint pair
is a weak homotopy equivalence in the sense that its geometric realization is so (Rourke & Sanderson 71, Rem. 5.8).
Notice that
for SimplicialSets, the geometric realization of the underlying semi-simplicial set is the fat geometric realization of (see there):
There is (by this Prop.) a natural weak homotopy equivalence from the fat to the ordinay geometric realization of a simplicial set (which is always “good” when regarded as a simplicial space):
It follows (see also MO:a/75101) that also the adjunction counit
is a simplicial weak equivalence.
The nerve of a semicategory is a semi-simplicial set (satisfying the Segal conditions) just as the nerve of a category is a simplicial set.
There is a model structure on semi-simplicial sets, transferred along the right adjoint to the forgetful functor from the model structure on simplicial sets.
Since the maps in are all strictly monotone, any object receives only (finitely many) morphisms from objects with whence all slices are finite. This is sufficient for all Grothendieck topologies on to be rigid whence all subtoposes of are essential and of presheaf type and their lattice is isomorphic to the lattice of Cauchy-complete full subcategories of .
This situation is familiar from but in the latter case there are fewer Cauchy-complete subcategories available, since an object having non-trivial idempotents its inclusion automatically requires the presence of all with < in the subcategory whence there are countably many subtoposes corresponding to the -truncated subcategories on the objects (plus the two trivial subcategories).
Recall that an essential localization of a topos embeds the corresponding subtopos as a reflective subcategory (i.e. sheaves for the corresponding topology) as well as a coreflective subcategory. For a given (essential) topology we call the presheaves in the image of the latter inclusion -skeleta. Recall that the Aufhebung of such a level topology is defined as the largest topology such that all -skeleta are -sheaves (if such a exists). This differs somewhat from the definition given at Aufhebung but will suffice in the present context where all subtoposes are levels.
The Lawvere-Tierney topologies on are indexed by infinite words over the alphabet . They are partially ordered by iff for all letter positions , where (unsurprisingly) letter 0 counts as smaller than letter 1. The information contained in the -th letter of is whether the closure operator corresponding to adds -dimensional semi-simplices to subobjects () or not () e.g. adds all semi-simplices of every dimension implying that the empty subobject is -dense in every object thereby preventing all non-terminal objects from being -sheaves i.e. while where no semi-simplex of any dimension is added and every presheaf is a -sheaf corresponds to . Another way to view the -th letter in is as specifying whether is () or is not () contained in the image of the subcategory inclusion corresponding to .
A topology restricts to a topology on the n-truncation by taking the prefix of length +1 e.g. are the four topologies on the 1-truncation, the topos of directed graphs.
The initial object is a -sheaf for the topology precisely when since otherwise every -sheaf contains exactly one vertex hence these correspond to the dense subtoposes of .
There is a countably infinite number of co-atoms where contains exactly one 0. These correspond to different copies of induced by the inclusion of the one-morphism category on the objects in . In particular, the dense double negation copy corresponds to , the -sheaves consisting of semi-simplicial sets with an arbitrary set of -semi-simplexes (= vertices) and exactly one -semi-simplex in the higher dimensions for every configuration of -1-semi-simplices which can bound an -semi-simplex. Since 0 is the only -skeletal presheaf we see incidentally that .
We denote the corresponding topologies by where indicates the position where the 0 occurs e.g. . Since the corresponds precisely to the groupoidal subcategories of the subtoposes are the only Boolean subtoposes of . The endofunctor of the -skeletal comonad on is given by (in particular, the -skeleta are those semi-simplicial sets with ). This basically replaces by its “set” of -semi-simplices in the disconnected form of copies of the standard -semi-simplex and discards everything else.
The Lawvere-Tierney topologies on simplicial sets can similarly described by infinite words over with the same interpretation of the letters but there has to start with a (possibly empty, possibly infinite) block of zeros expressing that the respective sheaf categories consist of -truncated simplicial sets, where is the length of the block of zeros with which starts e.g. corresponds to the 1-truncation, the topos of reflexive graphs.
In these topologies with correspond precisely to the open subtoposes. To see, this consider the terminal object 1 of : in contrast to SSet where the degeneracies prevent this, we can truncate 1 at arbitrary dimensions by simply discarding the higher dimensional semi-simplices. Hence there is a countably infinite number of non-trivial subterminal objects around this time with . By generalities, the corresponding open subtopos is equivalent to but clearly this is equivalent to the full subcategory of semi-simplicial sets with .
These are precisely the -skeleta of whereas the -sheaves are presheaves that have unique filling -semi-simplices for . Hence, a -skeletal presheaf is an -sheaf and in general not a -sheaf for any with since . Accordingly, : the “Hegelian Aufhebung of ” starting with passes stepwise exactly through the open subtoposes except the “subtopos at ” for which . This contrasts somewhat with the situation in SSet where for (cf. Aufhebung for more on this case).
Before determining the topologies for the closed subtoposes, let’s have a look at the lattice operations: the join of two topologies is given by the topology with in case or else . As usual, the sheaf topos corresponding to is given by the intersection of the two sheaf toposes. The meet is given by with in case or else . Hence the complement of a topology is given by with for all e.g. for an open topology the closed complement is given by .
The open and closed topologies are far from being the only complemented topologies - the letter flipping operation provides a complement for every topology . Hence, the lattice of topologies is not only as usually a Heyting algebra but a Boolean algebra, in fact, the product algebra .
Let us call a topology locally closed when the corresponding sheaf topos is locally closed i. e. is the join of an open and a closed topology. The locally closed topologies that are neither open nor closed themselves are then necessarily of the form .
For further details on the Lawvere-Tierney topologies, closure operators and sheaves involved in both cases see Rosset-Hansen-Endrullis (2024).
The original paper Eilenberg & Zilber 50 defined both (what we now call) semi-simplicial sets, under the name semi-simplicial complexes, and (what we now call) simplicial sets, under the name complete semi-simplicial complexes. The motivation for the name “semi-simplicial” was that a semi-simplicial set is like a simplicial complex, but lacks the property that a simplex is uniquely determined by its vertices. Then they added the degeneracies and a corresponding adjective “complete.”
Over time it became clear that “complete semi-simplicial complexes” were much more important and useful than the non-complete ones. This seems to have led first to the omission of the adjective “complete,” and then the omission of the prefix “semi” (and at some point the replacement of “complex” by “set”), resulting in the current name simplicial sets.
The concept is essentially the same as that of -set, as used by Rourke & Sanderson 71. Their motivation was from geometric topology.
On the other hand, in other contexts the prefix “semi-” is used to denote absence of identities (such as a semigroup (which is, admittedly, missing more than identities relative to a group) or a semicategory), thus if we start from the modern name “simplicial sets” it makes independent sense to refer to their degeneracy-less variant as “semi-simplicial sets.” This is coincidentally in line with the original terminology of Eilenberg and Zilber, but not of course with the intermediate usage of “semi-simplicial set” for what we now call a “simplicial set.”
Note also the existence of an alternative terminology “presimplicial sets”, or “pre-simplicial sets”, which can be traced back at least to the textbook “Cellular Structures in Topology” by Fritsch and Piccinini in 1990. This terminology is commonly used e.g. in the context of simplicial models for concurrent programs or higher-dimensional automata (see e.g. “First introduction to simplicial sets” by Sina Hazratpour).
Similarly, the subcategory of injective functions of the simplex category was written at some time of the history (e.g. in Rourke & Sanderson 71) but this is now the standard notation for the simplex category. In the more recent history, different notations can be found but none seems to be widely adopted. emphasizes that it is the subcategory of that raise the degree when is seen as a Reedy category but the may also ambiguously suggests that it adds something to . The notation emphasizes that it is the subcategory of injective morphisms of . Similarly for though less explicitly. The notation (e.g. in Friedman) has the risk of introducing a confusion for readers used with the hat notation for presheaves. The notation and (e.g. in Sina Hazratpour) express that it is a variant of but without giving precisions.
Samuel Eilenberg, Joseph Zilber, Semi-Simplicial Complexes and Singular Homology, Annals of Mathematics vol. 51 no. 3 (1950), 499–513 (jstor:1969364)
Daniel Kan, Is an ss complex a css complex?, Advances in Mathematics
Volume 4, Issue 2, April 1970, Pages 170-171 (doi:10.1016/0001-8708(70)90021-6)
Colin Rourke, Brian Sanderson, Δ-Sets I: Homotopy Theory. The Quarterly Journal of Mathematics 22: 321–338 (1971) (doi:10.1093/qmath/22.3.321, pdf)
S. Buoncristiano, Colin Rourke, Brian Sanderson, A geometric approach to Homology Theory, LMS Lect. Notes 18, (1976)
Peter Hilton, On a generalization of nilpotency to semi-simplicial complexes (pdf)
Alex Heller, Homotopy resolutions of semi-simplicial complexes, Transactions of the American Mathematical Society Vol. 80, No. 2 (Nov., 1955), pp. 299-344 (JSTOR)
James McClure, On semisimplicial sets satisfying the Kan condition (arXiv:1210.5650).
Greg Friedman, An elementary illustrated introduction to simplicial sets, Rocky Mountain J. Math. 42(2): 353-423 (2012) (arXiv:0809.4221).
Andrew Ranicki, Algebraic L-Theory and Topological Manifolds, Cambridge University Press 2002.
See also the references at semi-simplicial object and:
Wikipedia, Delta sets
MO, Semi-simplicial versus simplicial sets (and simplicial categories) Degeneracies for semi-simplicial Kan complexes
On the model structure on semi-simplicial sets:
as a weak model category:
as a semi-model category:
as a fibration category and cofibration category:
on the lattice of Lawvere-Tierney topologies:
Last revised on November 21, 2024 at 11:13:31. See the history of this page for a list of all contributions to it.